Super ( , - Edge - Antimagic Graphs
نویسنده
چکیده
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a one-to-one and onto mapping f from ∪ , ,... , such that the edge weights , ∈ form an AP progression with first term ’a’ and common difference ’d’. The graph G is said to be Super (a,d)-edge-antimagic total labeling if the , , ... , . In this paper we obtain Super (a,d)-edge-antimagic properties of certain classes of graphs, including Fans graph, Single fan graph, Half Kite graph and Ambrela graph. Keyword – Vertex Labeling1 Edge Labeling2 Edge-Antimagic3 Edge-Weight4. 2010 Mathematics Subject Classification: Primary 05C78; Secondary 05C76.
منابع مشابه
On super (a, d)-edge antimagic total labeling of certain families of graphs
A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . ,...
متن کاملSuper (a, d)-edge antimagic total labelings of friendship graphs
An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1, 2, 3, . . . , p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv);uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edgeantimagic total labeling is called a sup...
متن کاملOn super (a, d)-edge-antimagic total labeling of disconnected graphs
A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijection f : V(G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge-weights, w(uv) = f(u) + f (v) + f (uv), uv ∈ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study supe...
متن کاملSuper edge-antimagic labeling of a cycle with a chord
An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping g taking the vertices and edges onto 1, 2, . . . , |V (G)| + |E(G)| so that the edgeweights w(uv) = g(u) + g(v) + g(uv), uv ∈ E(G), form an arithmetic progression with initial term a and common difference d. Such a labeling is called super if the smallest labels appear on the vertices. In this paper, we investigate the existen...
متن کاملSuper Magic and Antimagic Labelings of Disjoint Union of Plane Graphs
SUPER MAGIC AND ANTIMAGIC LABELINGS OF DISJOINT UNION OF PLANE GRAPHS Ali Ahmad, Martin Bača, Marcela Lascsáková, Andrea Semaničová-Feňovčíková 2,3 College of computer and information system, Jazan University, Jazan, Saudi Arabia Department of Appl. Mathematics and Informatics, Technical University, Košice, Slovak Republic Abdus Salam School of Mathematical Sciences, G. C. University, Lahore, P...
متن کامل